LeetCode Solutions

Appearance

630. 课程表 III ​

为保证权益，题目请参考 630. 课程表 III(From LeetCode).

解决方案1 ​

Python ​

python
# 630. 课程表 III
# https://leetcode-cn.com/problems/course-schedule-iii/


################################################################################


from typing import List
import heapq


class Solution:
    def scheduleCourse(self, courses: List[List[int]]) -> int:
        courses.sort(key=lambda x: x[1])

        que = []
        total = 0

        for t, d in courses:
            if total + t <= d:
                total += t

                heapq.heappush(que, -t)
            else:
                if len(que) != 0 and -que[0] > t:
                    total = total + que[0] + t
                    heapq.heappop(que)
                    heapq.heappush(que, -t)

        return len(que)

################################################################################